Step of Proof: before_last
11,40
postcript
pdf
Inference at
*
1
I
of proof for Lemma
before
last
:
1.
T
: Type
2.
T
List
x
:
T
. (
x
[])
(
(
x
= last([])))
x
before last([])
[]
latex
by ((((((D 0)
CollapseTHENM (D 0))
)
CollapseTHENM (RWO "nil_member" (-1)))
)
CollapseTHEN (
C
(Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n)) (first_tok :t) inil_term)))
latex
C
.
Definitions
t
T
,
P
Q
,
x
:
A
.
B
(
x
)
,
P
&
Q
,
P
Q
,
False
,
Lemmas
l
member
wf
,
nil
member
origin